On (p, q)-rough paths
نویسندگان
چکیده
We extend the work of T. Lyons [Lyo98] and T. Lyons and Z. Qian [LQ02] to define integrals and solutions of differential equations along product of p and q rough paths, with 1/p+1/q > 1. We use this to write an Itô formula at the level of rough paths, and to see that any rough path can always be interpreted as a product of a p-geometric rough path and a p/2-geometric rough path.
منابع مشابه
A Variation Embedding Theorem and Applications
Fractional Sobolev spaces, also known as Besov or Slobodetzki spaces, arise in many areas of analysis, stochastic analysis in particular. We prove an embedding into certain q-variation spaces and discuss a few applications. First we show q-variation regularity of Cameron-Martin paths associated to fractional Brownian motion and other Volterra processes. This is useful, for instance, to establis...
متن کاملRough approximation operators based on quantale-valued fuzzy generalized neighborhood systems
Let $L$ be an integral and commutative quantale. In this paper, by fuzzifying the notion of generalized neighborhood systems, the notion of $L$-fuzzy generalized neighborhoodsystem is introduced and then a pair of lower and upperapproximation operators based on it are defined and discussed. It is proved that these approximation operators include generalized neighborhood system...
متن کاملارائه روشی ترکیبی برای افزایش دقت پیشبینی در کاهش داده با استفاده از مدل مجموعه راف و هوش تجمعی
Designing a system with an emphasis on minimal human intervention helps users to explore information quickly. Adverting to methods of analyzing large data is compulsory as well. Hence, utilizing power of the data mining process to identify patterns and models become more essential from aspect of relationship between the various elements in the database and discover hidden knowledge. Therefore, ...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملA note on higher dimensional p - variation ∗
Abstract We discuss p-variation regularity of real-valued functions defined on [0, T], based on rectangular increments. When p > 1, there are two slightly different notions of p-variation; both of which are useful in the context of Gaussian roug paths. Unfortunately, these concepts were blurred in previous works [2, 3]; the purpose of this note is to show that the afore-mentioned notions of p-v...
متن کامل